Problem size, parallel architecture, and optimal speedup

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Algorithms with Optimal Speedup for Bounded Treewidth

We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algorithm works in O((logn)) time using O(n) operations on the EREW PRAM. We also give faster parallel algorithms with optimal speedup for the problem of deciding whether the treewidth of an input graph is bounded by a given...

متن کامل

Superlinear Speedup in Parallel Computation

Speedup of a parallel computation is defined as Sp = T/Tp [2], where T is the sequential time of a problem and Tp is the parallel time to solve the same problem using p processors. Tp was argued to be no greater than P in [3]. However, in practice, people observed “superlinear speedup”, i.e. the speedup with P processors is greater than P. Two main reasons for superlinear speedup are shown in [...

متن کامل

Parallelized QuickSort with Optimal Speedup

Knuth (1973,pp2-3) notes that sorting is estimated to take up 25% of the world’s computer time. With the advent of the microcomputer this may well have changed, but it is nonetheless a both practically and theoretically interesting task. Sorting, in the sense of bringing together related things, has now been subsumed by.the more specific task of ordering, and has spawned an enormous number of s...

متن کامل

The Unified Parallel Speedup Model and Simulator

This paper develops a unified parallel processing speedup model, that integrates parallel processing models from pipelines within the CPU to clustered and distributed multi−computers. The different software/algorithm parallelism models are analyzed at each level of parallelism, as well as the hardware architecture developed to capitalize on the potential speedup. By integrating the different le...

متن کامل

Parallel Natural Language Parsing: From Analysis to Speedup Parallel Natural Language Parsing: From Analysis to Speedup

Preface The research presented in this thesis done in the context of the " Parallel Natural Language Interfaces " subproject of the IMPACT project. The IMPACT project was headed by the ING bank and founded by the organization for High Performance Computing and Networking (HPCN), itself partly funded by NWO. The goal of this subproject was to improve the performance of natural language interface...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Parallel and Distributed Computing

سال: 1988

ISSN: 0743-7315

DOI: 10.1016/0743-7315(88)90005-6